Statistical signal processing with nonnegativity constraints
نویسندگان
چکیده
Nonnegativity constraints arise frequently in statistical learning and pattern recognition. Multiplicative updates provide natural solutions to optimizations involving these constraints. One well known set of multiplicative updates is given by the ExpectationMaximization algorithm for hidden Markov models, as used in automatic speech recognition. Recently, we have derived similar algorithms for nonnegative deconvolution and nonnegative quadratic programming. These algorithms have applications to low-level problems in voice processing, such as fundamental frequency estimation, as well as high-level problems, such as the training of large margin classifiers. In this paper, we describe these algorithms and the ideas that connect them.
منابع مشابه
An MCMC Method for Uncertainty Quantification in Nonnegativity Constrained Inverse Problems
The development of computational algorithms for solving inverse problems is, and has been, a primary focus of the inverse problems community. Less studied, but of increased interest, is uncertainty quantification for solutions of inverse problems obtained using computational methods. In this paper, we present a method of uncertainty quantification for linear inverse problems with nonnegativity ...
متن کاملReweighted nonnegative least-mean-square algorithm
Statistical inference subject to nonnegativity constraints is a frequently occurring problem in signal processing. The nonnegative least-mean-square (NNLMS) algorithm was derived to address such problems in an online way. This algorithm builds on a fixed-point iteration strategy driven by the Karush-Kuhn-Tucker conditions. It was shown to provide low variance estimates, but it however suffers f...
متن کاملFast Nonnegative Tensor Factorization with an Active-Set-Like Method
We introduce an efficient algorithm for computing a low-rank nonnegative CANDECOMP/PARAFAC (NNCP) decomposition. In text mining, signal processing, and computer vision among other areas, imposing nonnegativity constraints to low-rank factors has been shown an effective technique providing physically meaningful interpretation. A principled methodology for computing NNCP is alternating nonnegativ...
متن کاملSparse Image and Video Recovery Using Gradient Projection for Linearly Constrained Convex Optimization
OF THE CAPSTONE PROJECT Sparse Image and Video Recovery Using Gradient Projection for Linearly Constrained Convex Optimization by Daniel Thompson May 2011 University of California, Merced Abstract This project concerns the reconstruction of a signal, which corresponds to either an image or a temporally-varying scene. Signal recovery can be accomplished through finding a sparse solution to an `2...
متن کاملParallel Algorithms for Constrained Tensor Factorization via the Alternating Direction Method of Multipliers
Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and machine learning. With few recent exceptions, all tensor factorization algorithms were originally developed for centralized, in-memory computation on a single machine; and the few that break away from this mold do not easily incorporate ...
متن کامل